Full-abstraction for Must Testing Preorders
نویسندگان
چکیده
The client must preorder relates tests (clients) instead of processes (servers). The existing characterisation of this preorder is unsatisfactory for it relies on the notion of usable clients which, in turn, are defined using an existential quantification over the servers that ensure client satisfaction. In this paper we characterise the set of usable clients for finite-branching LTSs, and give a sound and complete decision procedure for it. We also provide a novel coinductive characterisation of the client preorder, which we use to argue that the preorder is decidable, thus positively answering the question opened in [5,3].
منابع مشابه
Completeness and Logical Full Abstraction in Modal Logics for Typed Mobile Processes
We study an extension of Hennessy-Milner logic for the π-calculus which gives a sound and complete characterisation of representative behavioural preorders and equivalences over typed processes. New connectives are introduced representing actual and hypothetical typed parallel composition and hiding. We study three compositional proof systems, characterising the May/Must testing preorders and b...
متن کاملOn Full Abstractness for Fair Testing
Fair-testing preorders were introduced in 13, 3] in order to overcome diiculties that traditional testing/failures preorders have in tackling divergent behavior. This paper establishes the appropriateness and \optimality" of the fair-must precongruence by proving that it is the coarsest precongruence respecting a natural notion of observable behavior (maximal traces) under a non-catastrophic in...
متن کاملMultiparty Testing Preorders
Variants of the must testing approach have been successfully applied in Service Oriented Computing for analysing the compliance between (contracts exposed by) clients and servers or, more generally, between two peers. It has however been argued that multiparty scenarios call for more permissive notions of compliance because partners usually do not have full coordination capabilities. We propose...
متن کاملCharacterising Testing Preorders for Broadcasting Distributed Systems
We present a process calculus for both specifying the desired behaviour of distributed systems and for describing their actual implementation; the calculus is aimed at the internet layer of the TCP/IP reference model. This allows us to define behavioural preorders in the style of DeNicola and Hennessy, relating specifications and implementations for distributed systems at this level of abstract...
متن کاملFull Abstraction in Structural Operational Semantics
This paper explores the connection between semantic equivalences for concrete sequential processes, represented by means of transition systems, and formats of transition system speciications using Plotkin's structural approach. For several equivalences in the linear time { branching time spectrum a format is given, as general as possible, such that this equivalence is a congruence for all opera...
متن کامل